Locations and Service Start Time of Flow-covering Facilities with Multiple Coverage Levels
نویسندگان
چکیده
This paper develops an extended version of MFCLSTP (Maximum Flow-Covering Location and service Start Time Problem, Tanaka 2011) by introducing multiple coverage levels based on the arrival time to a destination. The original MFCLSTP determines the locations of facilities and the start time of services of fixed duration to maximize coverage for flows on the way back home from work. In MFCLSTP, each flow is either fully covered if commuters can be back home by a given time (after consuming service from start to end at a facility), or not covered at all otherwise. In many situations, a service which ensures that commuters can be back home early is more desirable. To describe this situation, we introduce different levels of coverage and allow the value of coverage to vary depending on the arrival time to a destination (home). The model is applied to the railway network of Chukyo area in Japan by using commuter flow data for railway users in this area. By employing a model with two coverage levels, we obtain the optimal set of stations to site facilities and their service start times. The results show that the optimal time to start a service tends to be earlier when more importance is placed on covering flows that can return home early.
منابع مشابه
Maximum Flow-covering Location and Service Start Time Problem and Its Application to Tokyo Metropolitan Railway Network
This paper proposes the Maximum Flow-Covering Location and service Start Time Problem (MFCLSTP). The problem seeks to determine locations and service start time of p facilities which provide a service for a given duration, so as to maximally cover flows. Each flow is specified by a pair of origindestination (OD) nodes and the departure time of the origin node. We assume that a given commuter fl...
متن کاملAn exact Method for Stochastic Maximal Covering Problem of Preventive Healthcare Facilities
Effective preventive healthcare services have a significant role in reducing fatality and medical expenses in all human societies and the level of accessibility of customers to these services can be considered as a measure of their efficiency and effectiveness. The main purpose of this paper is to develop a service network design model of preventive healthcare facilities with the principal obje...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملEfficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation)
In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...
متن کاملLocating Flow Capturing Facilities on A Railway Network with Two Levels of Coverage
This paper presents a flow capturing location problem which focuses on railway passenger flows. The flow capturing location problem (FCLP), originally proposed by Hodgson (1990), aims to locate a given number of facilities on a network to maximize the total flow that can obtain service at facilities along their pre-planned routes. For railway users, facilities located at the origin station and ...
متن کامل